Introduction to the Witness-Functions for Secrecy in Cryptographic Protocols

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Guarantee Secrecy for Cryptographic Protocols

In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we de...

متن کامل

Secrecy by Witness Functions

In this paper, we introduce a new type of functions to analyze cryptographic protocols statically for the property of secrecy: the Witness-Functions. A Witness-Function is a reliable protocol-dependent function intended to prove the correctness of a protocol through its growth. It bases its calculation on the static part of a message in a role-based speci cation and ignores the dynamic one by i...

متن کامل

Introduction to Cryptographic Protocols

1 : x||y String x is concatenated with string y. 2 : λ(C) Distribution of a given instance or random variable C. 3 : D(X, Y) Statistical distance between the distributions of the two random variables X and Y. 6 : = Stat Statistical indistinguishability between two Random Variables: see Definition 8. 7 : = Comp Computational indistinguishability between two Random Variables: see Definition 9. 8 ...

متن کامل

A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions

In this paper, we enunciate the theorem of secrecy in tagged protocols using the theory of witness-functions and we run a formal analysis on a new tagged version of the Needham-Schroeder public-key protocol using this theorem. We discuss the significance of tagging in securing cryptographic protocols as well.

متن کامل

A Semi-Decidable Procedure for Secrecy in Cryptographic Protocols

In this paper, we present a new semi-decidable procedure to analyze cryptographic protocols for secrecy based on a new class of functions that we call: the Witness-Functions. A Witness-Function is a reliable function that guarantees the secrecy in any protocol proved increasing once analyzed by it. Hence, the problem of correctness becomes a problem of protocol growth. A Witness-Function operat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Modeling and Optimization

سال: 2015

ISSN: 2010-3697

DOI: 10.7763/ijmo.2015.v5.459